Characterization of non-universal two-qubit Hamiltonians
نویسنده
چکیده
It is known that almost all 2-qubit gates are universal for quantum computing (Lloyd 1995; Deutsch, Barenco, Eckert 1995). However, an explicit characterization of non-universal 2-qubit gates is not known. We consider a closely related problem of characterizing the set of non-universal 2-qubit Hamiltonians. We call a 2-qubit Hamiltonian n-universal if, when applied on different pairs of qubits, it can be used to approximate any unitary operation on n qubits. It follows directly from the results of Lloyd and Deutsch, Barenco, Eckert, that almost any 2-qubit Hamiltonian is 2-universal. Our main result is a complete characterization of 2-non-universal 2-qubit Hamiltonians. There are three cases when a 2-qubit Hamiltonian H is not universal: (1) H shares an eigenvector with the gate that swaps two qubits; (2) H acts on the two qubits independently (in any of a certain family of bases); (3) H has zero trace. The last condition rules out the Hamiltonians that generate SU(4)—it can be omitted if the global phase is not important. A Hamiltonian that is not 2-universal can still be 3-universal. We give a (possibly incomplete) list of 2-qubit Hamiltonians that are not 3-universal. If this list happens to be complete, it actually gives a classification of n-universal 2-qubit Hamiltonians for all n ≥ 3.
منابع مشابه
Characterization of universal two-qubit Hamiltonians
Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. While it is well known that almost any 2-qubit Hamiltonian is 2-universal (Deutsch, Barenco, Ekert 1995; Lloyd 1995), an explicit characterization of the set of non-universal 2-qubit Hamiltonians has been elusive. Our mai...
متن کاملQuantum Computing Without Wavefunctions: Time-Dependent Density Functional Theory for Universal Quantum Computation
We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of ap...
متن کاملQuantum speedup in stoquastic adiabatic quantum computation
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...
متن کاملar X iv : q ua nt - p h / 06 12 18 6 v 1 2 1 D ec 2 00 6 Graph states as ground states of many - body spin - 1 / 2 Hamiltonians
We consider the problem whether graph states can be ground states of local interaction Hamiltonians. For Hamiltonians acting on n qubits that involve at most two-body interactions, we show that no n-qubit graph state can be the exact, non-degenerate ground state. We determine for any graph state the minimal d such that it is the non-degenerate ground state of a d-body interaction Hamiltonian, w...
متن کاملDynamically protected cat-qubits: a new paradigm for universal quantum computation
We present a new hardware-efficient paradigm for universal quantum computation which is based on encoding, protecting and manipulating quantum information in a quantum harmonic oscillator. This proposal exploits multiphoton driven dissipative processes to encode quantum information in logical bases composed of Schrödinger cat states. More precisely, we consider two schemes. In a first scheme, a...
متن کامل